Categorical Abstract Algebraic Logic: Equivalence of Closure Systems

نویسنده

  • George Voutsadakis
چکیده

In their famous “Memoirs” monograph, Blok and Pigozzi defined algebraizable deductive systems as those whose consequence relation is equivalent to the algebraic consequence relation associated with a quasivariety of universal algebras. In characterizing this property, they showed that it is equivalent with the existence of an isomorphism between the lattices of theories of the two consequence relations that commutes with inverse substitutions. Thus emerged the prototypical and paradigmatic result relating an equivalence between two consequence relations established by means of syntactic translations and the isomorphism between corresponding lattices of theories. This result was subsequently generalized in various directions. Blok and Pigozzi themselves extended it to cover equivalences between k-deductive systems. Rebagliato and Verdú and, later, also Pynko and Raftery, considered equivalences between consequence relations on associative sequents. The author showed that it holds for equivalences between two term π-institutions. Blok and Jónsson considered equivalences between structural closure operations on regular M -sets. Gil-Férez lifted the author’s results to the case of multi-term π-institutions. Finally, Galatos and Tsinakis considered the case of equivalences between closure operators on A-modules and provided an exact characterization of those that are induced by syntactic translations. In this paper, we contribute to this line of research by further abstracting the results of Galatos and Tsinakis to the case of consequence systems on Sign-module systems, which are set-valued functors SEN : Sign → Set on complete residuated categories Sign.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Categorical Abstract Algebraic Logic on Admissible Equivalence Systems

Given a sentential logic S there exists a least sentential logic ad S associated with the set S Thm of the theorems of . S If the logic S is equivalential, then the behavioral theorems of S Thm can be determined by an equivalence system for , S but, possibly, they may also be determined by any admissible equivalence system, i.e., an equivalence system for . ad S Babenyshev and Martins studied t...

متن کامل

Categorical Abstract Algebraic Logic: Closure Operators on Classes of PoFunctors

Following work of Pa lasińska and Pigozzi on partially ordered varieties and quasi-varieties of universal algebras, the author recently introduced partially ordered systems (posystems) and partially ordered functors (pofunctors) to cover the case of the algebraic systems arising in categorical abstract algebraic logic. Analogs of the ordered homomorphism theorems of universal algebra were shown...

متن کامل

Categorical Abstract Algebraic Logic: Partially Ordered Algebraic Systems

An extension of parts of the theory of partially ordered varieties and quasivarieties, as presented by Paaasińska and Pigozzi in the framework of abstract algebraic logic, is developed in the more abstract framework of categorical abstract algebraic logic. Algebraic systems, as introduced in previous work by the author, play in this more abstract framework the role that universal algebras play ...

متن کامل

Categorical Abstract Algebraic Logic Local Deduction Theorems for π-Institutions

In this paper, some of the results of Blok and Pigozzi on the local deductiondetachment theorems (LDDT) in Abstract Algebraic Logic, which followed pioneering work of Czelakowski on the same topic, are abstracted to cover logics formalized as π-institutions. The relationship between the LDDT and the property of various classes of I-matrices having locally definable principal I-filters is invest...

متن کامل

Categorical Abstract Algebraic Logic: Equivalential

The theory of equivalential deductive systems, as introduced by Prucnal and Wroński and further developed by Czelakowski, is abstracted to cover the case of logical systems formalized as π-institutions. More precisely, the notion of an N-equivalence system for a given π-institution is introduced. A characterization theorem for N-equivalence systems, previously proven for N-parameterized equival...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014